Locality Helps Sleep Scheduling
نویسنده
چکیده
This work studies sleep scheduling in mobile-device centric sensor networks. The objective is to maximise the lifetime by exploiting redundancy in an over-deployed network. Redundancy is described by a redundancy graph; it turns out that typical realistic redundancy graphs are members of the family of local graphs. By using a divide-and-conquer technique based on modular grids, it is shown that sleep scheduling admits a polynomial-time approximation scheme in local graphs; this is not the case in arbitrary graphs.
منابع مشابه
Exploiting Temporal Locality for Energy Efficient Memory Management
Memory is becoming one of the major power consumers in computing systems. Therefore energy efficient memory management is essential. Modern memory systems employ sleep states for energy saving. To utilize this feature, existing research activities have concentrated on increasing spatial locality to deactivate as many blocks as possible. However they did not count the unexpected activation of me...
متن کاملLightweight Scheduling for Balancing the Tradeoff Between Load Balance and Locality
Performance irregularities on massively parallel processors lead to load imbalances and a significant loss of performance. Multi-core nodes suggest a promising way to redistribute work within a node, thus mitigating performance irregularities. However, there exists a non-trivial cost to redistributing work, and associated data, across cores. We investigate how work can be equitably distributed ...
متن کاملLOCALITY AND LOOP SCHEDULING ON NUMAMULTIPROCESSORSHui
An important issue in the parallel execution of loops is how to partition and schedule the loops onto the available processors. While most existing dynamic scheduling algorithms manage load imbalances well, they fail to take locality into account and therefore perform poorly on parallel systems with non-uniform memory access times. In this paper, we propose a new loop scheduling algorithm, Loca...
متن کاملLocality Information Based Scheduling in Shared Memory Multiprocessors
Lightweight threads have become a common abstraction in the field of programming languages and operating systems. This paper examines the performance implications of locality information usage in thread scheduling algorithms for scal-able shared-memory multiprocessors. The elements of a distributed scheduler using all available locality information as well as experimental measurements are prese...
متن کاملHadoop Scheduling Base On Data Locality
In hadoop, the job scheduling is an independent module, users can design their own job scheduler based on their actual application requirements, thereby meet their specific business needs. Currently, hadoop has three schedulers: FIFO, computing capacity scheduling and fair scheduling policy, all of them are take task allocation strategy that considerate data locality simply. They neither suppor...
متن کامل